Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
نویسندگان
چکیده
منابع مشابه
Minimum Augmentation of Edge-Connectivity with Monotone Requirements in Undirected Graphs
For a finite ground set V , we call a set-function r : 2 → Z monotone, if r(X ′) ≥ r(X) holds for each X ′ ⊆ X ⊆ V , where Z is the set of nonnegative integers. Given an undirected multigraph G = (V,E) and a monotone requirement function r : 2 → Z, we consider the problem of augmenting G by a smallest number of new edges so that the resulting graph G′ satisfies dG′(X) ≥ r(X) for each ∅ 6= X ⊂ V...
متن کاملMinimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
Given an undirected multigraph G = (V,E), a family W of sets W ⊆ V of vertices (areas), and a requirement function r : W → Z+ (where Z+ is the set of nonnegative integers), we consider the problem of augmenting G by the smallest number of new edges so that the resulting graph has at least r(W ) edge-disjoint paths between v and W for every pair of a vertex v ∈ V and an area W ∈ W. So far this p...
متن کاملParallel and fast sequential algorithms for undirected edge connectivity augmentation
In the edge connectivity augmentation problem one wants to find an edge set of minimum total capacity that increases the edge connectivity of a given undirected graph by τ . It is a known non-trivial property of the edge connectivity augmentation problem that there is a sequence of edge sets E1, E2, . . . , such that ⋃ i≤τ Ei optmially increases the connectivity by τ , for any integer τ . The m...
متن کاملThe Restricted Edge-Connectivity of Kautz Undirected Graphs
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. The restricted edge-connectivity λ′ of a connected graph is the minimum number of edges whose deletion results in a disconnected graph such that each connected component has at least two vertices. A graph G is called λ′-optimal if λ′(G) = min{dG(u)+dG(v)−2 : uv is an edge in G}. This paper proves t...
متن کاملThe Restricted Edge-Connectivity of de Bruijn Undirected Graphs
A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. The restricted edge-connectivity λ′ of a connected graph is the minimum number of edges whose deletion results in a disconnected graph such that each component has at least two vertices. It has been shown by A. H. Esfahanian and S. L. Hakimi [On computing a conditional edge-connectivity of a graph....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2009
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2008.08.002